Scalable data series subsequence matching with ULISSE
نویسندگان
چکیده
منابع مشابه
Ranked Subsequence Matching in Time-Series Databases
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence matching under time warping, which finds top-k subsequences most similar to a query sequence from data sequences. To the best of our knowledge, this is the first and most sophisticated subsequence matching solution mentione...
متن کاملQuantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data space using different metrics. However, searching high-dimensional spaces using a hierarchical index is not always efficient because a large portion of the index might need to be accessed during search. We have revisit...
متن کاملEecient Time-series Subsequence Matching Using Duality in Constructing Windows Eecient Time-series Subsequence Matching Using Duality in Constructing Windows
Subsequence matching in time-series databases is an important problem in data mining and has attracted a lot of research interest. It is a problem of nding the data sequences containing subsequences similar to a given query sequence and of nding the oosets of these subsequences in the original data sequences. In this paper, we propose a new approach (Dual Match) to subsequence matching that exp...
متن کاملEmploying Subsequence Matching in Audio Data Processing
We overview current problems of audio retrieval and time-series subsequence matching. We discuss the usage of subsequence matching approaches in audio data processing, especially in automatic speech recognition (ASR) area and we aim at improving performance of the retrieval process. To overcome the problems known from the time-series area like the occurrence of implementation bias and data bias...
متن کاملFast Subsequence Search on Time Series Data
Many applications on time series data require solving the subsequence search problem, which has been extensively studied in the database and data mining communities. These applications are computation bound rather than disk I/O bound. In this work, we further propose effective and cheap lower-bounds to reduce the computation cost of the subsequence search problem. Experimental studies show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2020
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-020-00619-4